On the Representability Number of Lexicographic Products in a Dedekind-Complete Chain
نویسنده
چکیده
For any two linear orderings L and M , the representability number reprM (L) of L in M is the least ordinal α such that L can be orderembedded into the lexicographic power Mα lex. We study reprM (L) in the particular case that L is a lexicographic product and M is a Dedekindcomplete chain. Mathematics Subject Classification: Primary: 06A05; Secondary: 03E05, 54F05, 91B16
منابع مشابه
On the Zagreb and Eccentricity Coindices of Graph Products
The second Zagreb coindex is a well-known graph invariant defined as the total degree product of all non-adjacent vertex pairs in a graph. The second Zagreb eccentricity coindex is defined analogously to the second Zagreb coindex by replacing the vertex degrees with the vertex eccentricities. In this paper, we present exact expressions or sharp lower bounds for the second Zagreb eccentricity co...
متن کاملRepresentable Lexicographic Products
A linear ordering is said to be representable if it can be order-embedded into the reals. Representable linear orderings have been characterized as those which are separable in the order topology and have at most countably many jumps. We use this characterization to study the representability of a lexicographic product of linear orderings. First we count the jumps in a lexicographic product in ...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملOn Lexicographic Products of Two Fuzzy Graphs
Abstract. In this paper, lexicographic products of two fuzzy graphs namely, lexicographic min-product and lexicographic max-product which are analogous to the concept lexicographic product in crisp graph theory are defined. It is illustrated that the operations lexicographic products are not commutative. The connected, effective and complete properties of the operations lexicographic products a...
متن کاملA Novel Sustainable Closed-loop Supply Chain Network Design by Considering Routing and Quality of Products
One of the strategic decisions that can be made in supply chain is designing its network which has high impact on costs, and satisfaction level of customers. This paper focuses on designing a distribution network including determining the number and location of facilities, how to allocate the customers in network, and also determining the extent of carrying different products from different ori...
متن کامل